On multiplicative graphs and the product conjecture
نویسندگان
چکیده
منابع مشابه
On strongly 2-multiplicative graphs
In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative
متن کاملThe ratio and product of the multiplicative Zagreb indices
The first multiplicative Zagreb index $Pi_1(G)$ is equal to the product of squares of the degree of the vertices and the second multiplicative Zagreb index $Pi_2(G)$ is equal to the product of the products of the degree of pairs of adjacent vertices of the underlying molecular graphs $G$. Also, the multiplicative sum Zagreb index $Pi_3(G)$ is equal to the product of the sum...
متن کاملOn multiplicative Zagreb indices of graphs
Todeschini et al. have recently suggested to consider multiplicative variants of additive graph invariants, which applied to the Zagreb indices would lead to the multiplicative Zagreb indices of a graph G, denoted by ( ) 1 G and ( ) 2 G , under the name first and second multiplicative Zagreb index, respectively. These are define as ( ) 2 1 ( ) ( ) v V G G G d v and ( ) ( ) ( ) ( ) 2...
متن کاملQuilting Stochastic Kronecker Product Graphs to Generate Multiplicative Attribute Graphs
We describe the first sub-quadratic sampling algorithm for the Multiplicative Attribute Graph Model (MAGM) of Kim and Leskovec (2010). We exploit the close connection between MAGM and the Kronecker Product Graph Model (KPGM) of Leskovec et al. (2010), and show that to sample a graph from a MAGM it suffices to sample small number of KPGM graphs and quilt them together. Under a restricted set of ...
متن کاملOn a Vizing-like conjecture for direct product graphs
Let (G) be the domination number of a graph G, and let G H be the direct product of graphs G and H. It is shown that for any k 0 there exists a graph G such that (G G) (G) 2 ? k. This in particular disproves a conjecture from 5].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 1988
ISSN: 0209-9683,1439-6912
DOI: 10.1007/bf02122553